//package leetcode;
//
//class Solution {
////    public boolean isPalindrome(String s) {
////        StringBuilder stringBuilder = new StringBuilder();
////        String str = s.toLowerCase();
////        for (int i = 0; i < str.length(); i++) {
////            char c = str.charAt(i);
////            if (c >= 'a' && c <= 'z') {
////                stringBuilder.append(c);
////            }
////        }
////
////        if(stringBuilder.toString()==stringBuilder.reverse().toString()){
////            return true;
////        }
////
////        return false;
////    }
//}
//
//public class Test1 {
//}
